93 research outputs found
Exploring the tree of numerical semigroups
In this paper we describe an algorithm visiting all numerical semigroups up
to a given genus using a well suited representation. The interest of this
algorithm is that it fits particularly well the architecture of modern
computers allowing very large optimizations: we obtain the number of numerical
semigroups of genus g 67 and we confirm the Wilf conjecture for g 60.Comment: 14 page
Representation theories of some towers of algebras related to the symmetric groups and their Hecke algebras
We study the representation theory of three towers of algebras which are
related to the symmetric groups and their Hecke algebras. The first one is
constructed as the algebras generated simultaneously by the elementary
transpositions and the elementary sorting operators acting on permutations. The
two others are the monoid algebras of nondecreasing functions and nondecreasing
parking functions. For these three towers, we describe the structure of simple
and indecomposable projective modules, together with the Cartan map. The
Grothendieck algebras and coalgebras given respectively by the induction
product and the restriction coproduct are also given explicitly. This yields
some new interpretations of the classical bases of quasi-symmetric and
noncommutative symmetric functions as well as some new bases.Comment: 12 pages. Presented at FPSAC'06 San-Diego, June 2006 (minor
explanation improvements w.r.t. the previous version
The biHecke monoid of a finite Coxeter group
The usual combinatorial model for the 0-Hecke algebra of the symmetric group
is to consider the algebra (or monoid) generated by the bubble sort operators.
This construction generalizes to any finite Coxeter group W. The authors
previously introduced the Hecke group algebra, constructed as the algebra
generated simultaneously by the bubble sort and antisort operators, and
described its representation theory.
In this paper, we consider instead the monoid generated by these operators.
We prove that it has |W| simple and projective modules. In order to construct a
combinatorial model for the simple modules, we introduce for each w in W a
combinatorial module whose support is the interval [1,w] in right weak order.
This module yields an algebra, whose representation theory generalizes that of
the Hecke group algebra. This involves the introduction of a w-analogue of the
combinatorics of descents of W and a generalization to finite Coxeter groups of
blocks of permutation matrices.Comment: 12 pages, 1 figure, submitted to FPSAC'1
Inversion of some series of free quasi-symmetric functions
We give a combinatorial formula for the inverses of the alternating sums of
free quasi-symmetric functions of the form F_{\omega(I)} where I runs over
compositions with parts in a prescribed set C. This proves in particular three
special cases (no restriction, even parts, and all parts equal to 2) which were
conjectured by B. C. V. Ung in [Proc. FPSAC'98, Toronto].Comment: 6 page
Trees, functional equations, and combinatorial Hopf algebras
One of the main virtues of trees is to represent formal solutions of various
functional equations which can be cast in the form of fixed point problems.
Basic examples include differential equations and functional (Lagrange)
inversion in power series rings. When analyzed in terms of combinatorial Hopf
algebras, the simplest examples yield interesting algebraic identities or
enumerative results.Comment: 14 pages, LaTE
On the representation theory of finite J-trivial monoids
In 1979, Norton showed that the representation theory of the 0-Hecke algebra
admits a rich combinatorial description. Her constructions rely heavily on some
triangularity property of the product, but do not use explicitly that the
0-Hecke algebra is a monoid algebra.
The thesis of this paper is that considering the general setting of monoids
admitting such a triangularity, namely J-trivial monoids, sheds further light
on the topic. This is a step to use representation theory to automatically
extract combinatorial structures from (monoid) algebras, often in the form of
posets and lattices, both from a theoretical and computational point of view,
and with an implementation in Sage.
Motivated by ongoing work on related monoids associated to Coxeter systems,
and building on well-known results in the semi-group community (such as the
description of the simple modules or the radical), we describe how most of the
data associated to the representation theory (Cartan matrix, quiver) of the
algebra of any J-trivial monoid M can be expressed combinatorially by counting
appropriate elements in M itself. As a consequence, this data does not depend
on the ground field and can be calculated in O(n^2), if not O(nm), where n=|M|
and m is the number of generators. Along the way, we construct a triangular
decomposition of the identity into orthogonal idempotents, using the usual
M\"obius inversion formula in the semi-simple quotient (a lattice), followed by
an algorithmic lifting step.
Applying our results to the 0-Hecke algebra (in all finite types), we recover
previously known results and additionally provide an explicit labeling of the
edges of the quiver. We further explore special classes of J-trivial monoids,
and in particular monoids of order preserving regressive functions on a poset,
generalizing known results on the monoids of nondecreasing parking functions.Comment: 41 pages; 4 figures; added Section 3.7.4 in version 2; incorporated
comments by referee in version
An operational calculus for the Mould operad
The operad of moulds is realized in terms of an operational calculus of
formal integrals (continuous formal power series). This leads to many
simplifications and to the discovery of various suboperads. In particular, we
prove a conjecture of the first author about the inverse image of non-crossing
trees in the dendriform operad. Finally, we explain a connection with the
formalism of noncommutative symmetric functions.Comment: 16 pages, one reference added and minor changes in v
- …